@Article{MoreiradeCarvalhoNogu:2012:NeMoMi,
               author = "Moreira de Carvalho, Marco Antonio and Nogueira Lorena, Luiz 
                         Antonio",
          affiliation = "{Ouro Preto Federal University} and {Instituto Nacional de 
                         Pesquisas Espaciais (INPE)}",
                title = "New models for the mirrored traveling tournament problem",
              journal = "Computers and Industrial Engineering",
                 year = "2012",
               volume = "63",
                pages = "1089--1095",
             keywords = "traveling tournament problem, sports scheduling, integer 
                         programming.",
             abstract = "The Mirrored Traveling Tournament Problem (mTTP) is a challenging 
                         combinatorial optimization problem which consists in generating a 
                         timetable for sports tournaments with two half series, what is 
                         equivalent to a double round-robin timetable problem. The distance 
                         traveled by the teams should be minimized in the final timetable, 
                         and a new objective is to minimize the longest distance traveled, 
                         named MinMaxTTP. It is proposed an integer programming formulation 
                         to the mTTP and two models with dynamic constraints to its 
                         solution. Both models are based on the detection of independent 
                         sets on conflict graphs, whose use has not been reported in the 
                         literature about the problem. Real data benchmarks from a baseball 
                         tournament are used in the experiments carried out.",
                  doi = "10.1016/j.cie.2012.08.002",
                  url = "http://dx.doi.org/10.1016/j.cie.2012.08.002",
                 issn = "0360-8352",
                label = "lattes: 7195702087655314 2 MoreiradeCarvalhoNogu:2012:NeMoMi",
             language = "pt",
        urlaccessdate = "30 abr. 2024"
}